On the error exponent for woven convolutional codes with inner warp
نویسندگان
چکیده
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.
منابع مشابه
Woven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملOn Permutor Design for Woven Convolutional Codes with Outer Warp
A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row pe...
متن کاملPipeline Decoding of Woven Convolutional Codes
A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...
متن کاملExponential Error Bounds for Block Concatenated Codes with Tail Biting Trellis Inner Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. An error exponent and decoding complexity for tail biting random trellis codes are shown. Then we propose a block concatenated code constructed by a tail biting trellis inner code and derive an error exponent and decoding complexity for the proposed code. The results obtained by the proposed code ...
متن کاملWoven Turbo Codes
A new code construction namely woven turbo codes, is presented , which is a variation of woven convolutional codes. Parallel encoders (turbo codes 2]) can be considered as a special case of woven turbo encoders, where only one outer and inner encoder is used. However, woven turbo codes with a larger number of outer codes yield higher minimum distances than turbo codes with random permutations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999